Parameterized Hash Functions

نویسندگان

  • Tomasz Bilski
  • Krzysztof Bucholc
  • Anna Grocholewska-Czurylo
  • Janusz Stoklosa
چکیده

Hash functions are used to generate a short form of an original message of any size. This short form is called a hash of a message or a message digest and is used in many cryptographic applications including message integrity verification and message authentication, in which case a keyed hash function is used. Hash function h operates on a message m of an arbitrary length. The result is a hash value h(m) which has a fixed size. A lot of recent cryptographic research has been devoted to methods of generating new hash functions which resulted for example in 64 proposals being submitted to the NIST SHA-3 competition for a new hash function in 2008 [1]. The objective while designing the HaF family of hash function was obviously the highest security while maintaining the best possible performance, however, at the same time the function should allow a flexible balance between security and performance which was achieved through parameterization.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fuzzy adaptive tracking control for a class of nonlinearly parameterized systems with unknown control directions

This paper addresses the problem of adaptive fuzzy tracking control for aclass of nonlinearly parameterized systems with unknown control directions.In this paper, the nonlinearly parameterized functions are lumped into the unknown continuous functionswhich can be approximated by using the fuzzy logic systems (FLS) in Mamdani type. Then, the Nussbaum-type function is used to de...

متن کامل

ADAPTIVE FUZZY TRACKING CONTROL FOR A CLASS OF PERTURBED NONLINEARLY PARAMETERIZED SYSTEMS USING MINIMAL LEARNING PARAMETERS ALGORITHM

In this paper, an adaptive fuzzy tracking control approach is proposed for a class of single-inputsingle-output (SISO) nonlinear systems in which the unknown continuous functions may be nonlinearlyparameterized. During the controller design procedure, the fuzzy logic systems (FLS) in Mamdani type are applied to approximate the unknown continuous functions, and then, based on the minimal learnin...

متن کامل

How to Construct Cryptosystems and Hash Functions in Weakened Random Oracle Models

In this paper, we discuss how to construct secure cryptosystems and secure hash functions in weakened random oracle models. The weakened random oracle model (WROM), which was introduced by Numayama et al. at PKC 2008, is a random oracle with several weaknesses. Though the security of cryptosystems in the random oracle model, ROM, has been discussed sufficiently, the same is not true for WROM. A...

متن کامل

Fast FAST

We present a randomized subexponential time, polynomial space parameterized algorithm for the k-Weighted Feedback Arc Set in Tournaments (k-FAST) problem. We also show that our algorithm can be derandomized by slightly increasing the running time. To derandomize our algorithm we construct a new kind of universal hash functions, that we coin universal coloring families. For integers m, k and r, ...

متن کامل

Parametric Local Multimodal Hashing for Cross-View Similarity Search

Recent years have witnessed the growing popularity of hashing for efficient large-scale similarity search. It has been shown that the hashing quality could be boosted by hash function learning (HFL). In this paper, we study HFL in the context of multimodal data for cross-view similarity search. We present a novel multimodal HFL method, called Parametric Local Multimodal Hashing (PLMH), which le...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Annales UMCS, Informatica

دوره 12  شماره 

صفحات  -

تاریخ انتشار 2012